Large Common Plansets-4-Points Congruent Sets for Point Cloud Registration
نویسندگان
چکیده
منابع مشابه
Markerless Point Cloud Registration with Keypoint-based 4-points Congruent Sets
This paper addresses the registration of LiDAR point clouds. More specifically, we present an automatic method for markerless registration of two such point clouds given in arbitrary local scan coordinates – i.e. without simplifying assumptions such as a common up-vector. Clearly, the critical step of the registration is to find a coarse initial alignment, to be refined with established local m...
متن کاملRobust surface registration using N-points approximate congruent sets
Scans acquired by 3D sensors are typically represented in a local coordinate system. When multiple scans, taken from different locations, represent the same scene these must be registered to a common reference frame. We propose a fast and robust registration approach to automatically align two scans by finding two sets of N -points, that are approximately congruent under rigid transformation an...
متن کاملFast Registration of Laser Scans with 4-points Congruent Sets – What Works and What Doesn’t
Sampling-based algorithms in the mould of RANSAC have emerged as one of the most successful methods for the fully automated registration of point clouds acquired by terrestrial laser scanning (TLS). Sampling methods in conjunction with 3D keypoint extraction, have shown promising results, e.g. the recent K-4PCS (Theiler et al., 2013). However, they still exhibit certain improbable failures, and...
متن کاملChallenging data sets for point cloud registration algorithms
The number of registration solutions in the literature has bloomed recently. The iterative closest point, for example, could be considered as the backbone of many laser-based localization and mapping systems. Although they are widely used, it is a common challenge to compare registration solutions on a fair base. The main limitation is to overcome the lack of accurate ground truth in current da...
متن کاملRegistration of multiple point sets
Registering 3D point sets subject to rigid body motion is a common problem in computer vision. The optimal transformation is usually specified to be the minimum of a weighted least squares cost. The case of 2 point sets has been solved by several authors using analytic methods such as SVD. In this paper we present a numerical method for solving the problem when there are more than 2 point sets....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISPRS International Journal of Geo-Information
سال: 2020
ISSN: 2220-9964
DOI: 10.3390/ijgi9110647